Small Animal Clinical Quiz

A ten-year old male Standard Poodle was brought into your hospital because the owner noticed that the dog had not been feeling well. It was obvious that the dog was severely depressed. The dog had a history of renal problems for the past two years

AnswerTree – a hyperplace-based game for collaborative mobile learning

In this paper we present AnswerTree, a collaborative mobile location-based educational game designed to teach 8-12 year olds about trees and wildlife within the University of Nottingham campus. The activity is designed around collecting virtual cards (similar in nature to the popular Top TrumpsTM games) containing graphics and information about notable trees. Each player begins by collecting one card from a game location, but then he or she can only collect further cards by answering questions – whose solutions are obtainable through sharing knowledge with other cardholders. This ostensibly allows each player to become a subject expert at the start of the game, encouraging collaborative interaction for the game to be successfully completed. In this initial paper we will outline the structure and background of this location based game. AnswerTree has been authored within the Hyperplace framework, and is a first implementation of a wider process to develop a flexible, multi-purpose platform for both individual and group location-based mobile learning

Never mind the iPhone X, battery life could soon take a great leap forward

First paragraph: Another suite of Apple iPhones, another media frenzy. Much has been written about the $999/£999 iPhone X, the demise of the home button, the “face ID” function, wireless charging and so on. Somewhere down the list of improvements was extra battery life, at least for the iPhone X, thanks to its new souped up A11 bionic processor

Genetic Programming + Proof Search = Automatic Improvement

Search Based Software Engineering techniques are emerging as important tools for software maintenance. Foremost among these is Genetic Improvement, which has historically applied the stochastic techniques of Genetic Programming to optimize pre-existing program code. Previous work in this area has not generally preserved program semantics and this article describes an alternative to the traditional mutation operators used, employing deterministic proof search in the sequent calculus to yield semantics-preserving transformations on algebraic data types. Two case studies are described, both of which are applicable to the recently-introduced `grow and graft' technique of Genetic Improvement: the first extends the expressiveness of the `grafting' phase and the second transforms the representation of a list data type to yield an asymptotic efficiency improvement

Search-based energy optimization of some ubiquitous algorithms

Reducing computational energy consumption is of growing importance, particularly at the extremes (i.e. mobile devices and datacentres). Despite the ubiquity of the JavaTM Virtual Machine (JVM), very little work has been done to apply Search Based Software Engineering (SBSE) to minimize the energy consumption of programs that run on it. We describe OPACITOR , a tool for measuring the energy consumption of JVM programs using a bytecode level model of energy cost. This has several advantages over time-based energy approximations or hardware measurements. It is: deterministic.  unaffected by the rest of the computational environment.  able to detect small changes in execution profile, making it highly amenable to metaheuristic search which requires locality of representation. We show how generic SBSE approaches coupled with OPACITOR achieve substantial energy savings for three widely-used software components. Multi-Layer Perceptron implementations minimis- ing both energy and error were found, and energy reductions of up to 70% and 39.85% were obtained over the original code for Quicksort and Object-Oriented container classes respectively. These highlight three important considerations for automatically reducing computational energy: tuning software to particular distributions of data; trading off energy use against functional properties; and handling internal dependencies which can exist within software that render simple sweeps over program variants sub-optimal. Against these, global search greatly simplifies the developer’s job, freeing development time for other tasks